graph coloring造句
例句與造句
- A min - conflict weight - learning algorithm for graph coloring problem
圖著色問題的一個最小沖突權值學習算法 - In this paper , four types of graph coloring are discussed : dynamic coloring , incidence coloring , entire coloring and edge - face coloring of planar graphs
本文討論了若干圖類的四種不同的著色問題：動態(tài)著色、關聯(lián)著色、平面圖的完備著色和邊面著色。 - By virtue of associating and improving the graph coloring algorithm and maximal matching algorithm , a coloring - matching algorithm is proposed to solve the exam - arrangement problem
摘要將安排考試課程與分配班級考場分別化為圖的染色與最大匹配問題，進而將兩種算法融合并改進，使之適合于實際應用。 - In the second part , this paper does deeply research on how to use the memory system effectively . firstly , this paper proposes a modified register allocation via graph coloring to alleviate port conflicts
然后,面對分體寄存器文件可能產(chǎn)生端口沖突的新問題,提出了改進的基于圖著色的寄存器分配法。 - Based on the combination of graph coloring model and the concept of spectrum quality grading , the proposed algorithm allocated the available spectrum to cognitive radio cells to meet demand maximally under qos guarantee
使用圖論著色模型，結合頻譜質(zhì)量分級概念，根據(jù)小區(qū)內(nèi)需求情況，該算法將網(wǎng)絡中周期檢測到的可用頻譜分配給各個認知小區(qū)，最大化滿足需求的同時，為業(yè)務提供服務質(zhì)量保障。 - It's difficult to find graph coloring in a sentence. 用graph coloring造句挺難的
- The concept of the relaxed game chromatic number of a graph was firstly introduced by chou , wang and zhu in [ 1 ] . it connects the coloring problem with the game theory , so it is a important subject in the graph coloring theory and is studied by many researchers
圖的松弛競賽色數(shù)首先是由周，王，朱[ 1 ]提出來的，它把對策論和染色理論兩個重要問題緊密聯(lián)系在一起，從而使它在圖染色理論中占有很重要的位置，并引起了眾多專家人士的興趣和關注。 - Then , the course of the development of register allocation strategy is illuminated in detail and a direct priority - based register allocation approach via the analysis and comparison of many improvements to the graph coloring strategy is proposed , it selects the split live range based on the priorities of the spilled live ranges not the priorities of the total candidate live ranges
然后,詳細闡明了寄存器分配策略的演化歷程,通過分析和比較基于圖著色法的各種改進方案,從實現(xiàn)最優(yōu)分配的角度,在chow和hennessy的寄存器分配方案的基礎上提出一種基于直接優(yōu)先級的寄存器分配策略,更直接、更具體地根據(jù)溢出活躍范圍段的優(yōu)先級決定切分。 - Based on the conclusion of organizing into trains and simulating the thoughts of dispatchers in district stations , this paper analyzes the features of time sets of shunting locomotives , constructs the reasonable graph model in the way of making out time sets , and converts it into the problem of graph coloring
在車流推算的基礎上，從應用計算機模擬區(qū)段站調(diào)度員思維的角度出發(fā)，通過分析車列占用調(diào)車機車時區(qū)集合的特點，使用劃分時間片的方法建立合適的調(diào)車機車安排的圖論模型，將調(diào)機運用問題轉化為頂點具有加權的圖的k -著色問題。